XML and better Web searching
نویسندگان
چکیده
منابع مشابه
Web Document Searching Using Enhanced Hyperlink Semantics Based on XML
We present a system that aims at increasing the flexibility and accuracy of information retrieval tasks in the World Wide Web. The system offers extended searching capabilities by enriching information related to hyperlinks between documents. It offers to documents’ authors the ability to attach additional information to hyperlinks and also provides suggestions on the information to be attached...
متن کاملNo Sorting? Better Searching!
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly meant as the task of arranging keys in increasing or decreasing order with respect to an underlying total order relation. The sorted organization is amenable for searching a set of n keys, since each search requires Θ(...
متن کاملSearching XML Documents - Preliminary Work
Structured document retrieval aims at exploiting the structure together with the content of documents to improve retrieval results. Several aspects of traditional information retrieval applied on flat documents have to be reconsidered. These include in particular, document representation, storage, indexing, retrieval, and ranking. This paper outlines the architecture of our system and the adapt...
متن کاملSearching for better plasmonic materials
Plasmonics is a research area merging the fields of optics and nanoelectronics by confining light with relatively large free-space wavelength to the nanometer scale thereby enabling a family of novel devices. Current plasmonic devices at telecommunication and optical frequencies face significant challenges due to losses encountered in the constituent plasmonic materials. These large losses seri...
متن کاملSearching for better fill-in
Minimum Fill-in is a fundamental and classical problem arising in sparse matrix computations. In terms of graphs it can be formulated as a problem of finding a triangulation of a given graph with the minimum number of edges. By the classical result of Rose, Tarjan, Lueker, and Ohtsuki from 1976, an inclusion minimal triangulation of a graph can be found in polynomial time but, as it was shown b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Library Hi Tech
سال: 1999
ISSN: 0737-8831
DOI: 10.1108/07378839910289475